Finite-element-model Updating Using Nelder–Mead Simplex and BFGS Methods
ثبت نشده
چکیده
This chapter presents the Nelder–Mead simplex method and the Broyden– Fletcher–Goldfarb–Shanno (BFGS) method for finite-element-model updating. The methods presented have been tested on a simple beam and an unsymmetrical H-shaped structure. It was noted that, on average, the Nelder–Mead simplex method gives more accurate results than did the BFGS method. This is mainly because the BFGS method requires the calculation of gradients, which is prone to numerical errors within the context of finiteelement-model updating.
منابع مشابه
Updating finite element model using frequency domain decomposition method and bees algorithm
The following study deals with the updating the finite element model of structures using the operational modal analysis. The updating process uses an evolutionary optimization algorithm, namely bees algorithm which applies instinctive behavior of honeybees for finding food sources. To determine the uncertain updated parameters such as geometry and material properties of the structure, local and...
متن کاملA HYBRID MODIFIED GENETIC-NELDER MEAD SIMPLEX ALGORITHM FOR LARGE-SCALE TRUSS OPTIMIZATION
In this paper a hybrid algorithm based on exploration power of the Genetic algorithms and exploitation capability of Nelder Mead simplex is presented for global optimization of multi-variable functions. Some modifications are imposed on genetic algorithm to improve its capability and efficiency while being hybridized with Simplex method. Benchmark test examples of structural optimization with a...
متن کاملIndian Iris Image Segmentation using Nelder-Mead Simplex Method
In this paper, we describe a new approach of employing Nelder-Mead optimization (NMO) simplex method in Iris image segmentation. In this paper we are using modified way of Libor masek method. In modified Libor masek method mainly in preprocessing phase in segmentation we are using Nelder-Mead search method also called as simplex method for calculation of center coordinates, radius and threshold...
متن کاملOptimization for Automatic History Matching
History matching is an inverse problem of partial differential equation on mathematics. We adopt the constrained non-linear optimization to handle this problem, defining the objective function as the weighted square sum of differences between the wells simulation values and the corresponding observation values. We develop an optimization computing program that include Zoutendijk feasible direct...
متن کاملA Mahalanobis Distance-based Diversification and Nelder-Mead Simplex Intensification Search Scheme for Continuous Ant Colony Optimization
Ant colony optimization (ACO) and its variants are applied extensively to resolve various continuous optimization problems. As per the various diversification and intensification schemes of ACO for continuous function optimization, researchers generally consider components of multidimensional state space to generate the new search point(s). However, diversifying to a new search space by updatin...
متن کامل